Graph Distances in the Data-Stream Model
نویسندگان
چکیده
منابع مشابه
Graph Distances in the Data-Stream Model
We explore problems related to computing graph distances in the data-stream model. The goal is to design algorithms that can process the edges of a graph in an arbitrary order given only a limited amount of working memory. We are motivated by both the practical challenge of processing massive graphs such as the web graph and the desire for a better theoretical understanding of the data-stream m...
متن کاملGraph Distances in the Data - Stream Model 1711
We explore problems related to computing graph distances in the data-stream model. The goal is to design algorithms that can process the edges of a graph in an arbitrary order given only a limited amount of working memory. We are motivated by both the practical challenge of processing massive graphs such as the web graph and the desire for a better theoretical understanding of the datastream mo...
متن کاملa study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
Distinct Distances in Graph Drawings
The distance-number of a graph G is the minimum number of distinct edgelengths over all straight-line drawings of G in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distancenumber of trees, graphs with no K− 4 -minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of gr...
متن کاملAn Exploration of Graph Based Approaches in Data Stream Mining
Progressive advancements in the data stream mining have paved way for many algorithms to solve the problem of concept drift, a serious problem due to the wavering nature of the real time concepts. Concepts tend to change with time therefore concept drift is unavoidable in data stream mining but efficient algorithms can be designed to detect the concept drift and solve the problem. This paper pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2009
ISSN: 0097-5397,1095-7111
DOI: 10.1137/070683155